Distributed transactions for reliable systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems

In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

متن کامل

Language-level Transactions for Modular Reliable Systems

The transaction model is a natural means to express atomicity, fault-tolerance, synchronization, and exception handling in reliable programs. A (lightweight, in-memory) transaction can be thought of as a sequence of program loads and stores which either commits or aborts. If a transaction commits, then all of the loads and stores appear to have run atomically with respect to other transactions....

متن کامل

Consistent Timestamping for Transactions in Distributed Systems

Tagging data in a database with timestamps that indicate when data was entered can be very useful It permits a user to query the database as of some historical time Further it permits a user to see a transaction consistent re cent version of the database without having this transaction interfere with ongoing updates This support requires that timestamp ordering represent a valid serialization o...

متن کامل

Scalable Transactions for Scalable Distributed Database Systems

Scalable Transactions for Scalable Distributed Database Systems

متن کامل

A Distributed Architecture for Transactions Synchronization in Distributed Database Systems

Various concurrency control algorithms have been proposed for use in distributed database systems. But, the number of algorithms available for the distributed concurrency control, come into one of three basic classes: locking algorithms, Timestamp algorithms and optimistic (or certification) algorithms. In this paper we are presenting a Distributed Transaction Processing Model and an approach f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGOPS Operating Systems Review

سال: 1985

ISSN: 0163-5980

DOI: 10.1145/323627.323641